Finding Roots of Polynomials Based on Root Moments
نویسنده
چکیده
This paper proposes using root moment method to find the roots of arbitrary polynomials. It has been proved that feedforward neural networks (FNN) trained with constrained learning (CL) back propagation (BP) algorithm can be used to estimate the distributions of roots of polynomials. It has been found, however, that using the different priori information implicit in the polynomials for CL-BP algorithm will result in different training time and different estimate values. By comparison, we find that the root moment method implicit in the polynomials can obviously lower the training time and leads to more accurate estimates. Therefore, in this paper the root moment method is employed to find the roots of arbitrary polynomials. This paper presents some computer simulation results, which support our claims.
منابع مشابه
Equiripple Minimum Phase FIR Filter Design From Linear Phase Systems Using Root Moments
In this brief we propose to design a minimum phase finite-impulse response (FIR) digital filter transfer function from a given equiripple linear phase FIR transfer function which has identical amplitude. The brief deals with two important issues. The first issue is that we are concentrating on very high degree polynomials for which factorization procedures for root extraction are unreliable. A ...
متن کاملOn finding complex roots of polynomials using the Routh array
We present a method, based on the Routh stability criterion, for transforming the task of finding the complex roots of a polynomial of even degree n with real coefficients to that of: (a) finding their real parts as the n/2 real roots of a polynomial of degree n(n−1)/2; (b) for each real part, calculating the corresponding imaginary part as a square root. We illustrate the method for polynomial...
متن کاملThe Amended DSeSC Power Method for Polynomial Root-Finding
Cardinal’s matrix version of the Sebastiao e Silva polynomial root-finder rapidly approximates the roots as the eigenvalues of the associated Frobenius matrix. We preserve rapid convergence to the roots but amend the algorithm to allow input polynomials with multiple roots and root clusters. As in Cardinal’s algorithm, we repeatedly square the Frobenius matrix in nearly linear arithmetic time p...
متن کاملMultiple root finder algorithm for Legendre and Chebyshev polynomials via Newton’s method
We exhibit a numerical technique based on Newton’s method for finding all the roots of Legendre and Chebyshev polynomials, which execute less iterations than the standard Newton’s method and whose results can be compared with those for Chebyshev polynomials roots, for which exists a well known analytical formula. Our algorithm guarantees at least nine decimal correct ciphers in the worst case, ...
متن کاملAlgebraic Moments – Real Root Finding and Related Topics –
Polynomial root finding is a classical and well studied problem in mathematics with practical applications in many areas. Various relevant questions can be reformulated into the task of finding all common roots of a given system of polynomials in several variables, the so-called algebraic variety or zero set. Traditionally, root finding algorithms are implemented in exact arithmetics over algeb...
متن کامل